Canonical Polyadic Decomposition With Auxiliary Information for Brain–Computer Interface
نویسندگان
چکیده
منابع مشابه
Canonical Polyadic Decomposition with Orthogonality Constraints
Canonical Polyadic Decomposition (CPD) of a higher-order tensor is an important tool in mathematical engineering. In many applications at least one of the matrix factors is constrained to be column-wise orthonormal. We first derive a relaxed condition that guarantees uniqueness of the CPD under this constraint and generalize the result to the case where one of the factor matrices has full colum...
متن کاملCanonical Polyadic Decomposition with a Columnwise Orthonormal Factor Matrix
Canonical Polyadic Decomposition (CPD) of a higher-order tensor is an important tool in mathematical engineering. In many applications at least one of the matrix factors is constrained to be column-wise orthonormal. We first derive a relaxed condition that guarantees uniqueness of the CPD under this constraint. Second, we give a simple proof of the existence of the optimal low-rank approximatio...
متن کاملAnalysis and Approximation of the Canonical Polyadic Tensor Decomposition
We study the least-squares (LS) functional of the canonical polyadic (CP) tensor decomposition. Our approach is based on the elimination of one factor matrix which results in a reduced functional. The reduced functional is reformulated into a projection framework and into a Rayleigh quotient. An analysis of this functional leads to several conclusions: new sufficient conditions for the existenc...
متن کاملA regularized nonnegative canonical polyadic decomposition algorithm with preprocessing for 3D fluorescence spectroscopy
We consider blind source separation in chemical analysis focussing on the 3D fluorescence spectroscopy framework. We present an alternative method to process the Fluorescence Excitation-Emission Matrices (FEEM): first, a preprocessing is applied to eliminate the Raman and Rayleigh scattering peaks that clutter the FEEM. To improve its robustness versus possible improper settings, we suggest to ...
متن کاملCanonical Polyadic Decomposition of Third-Order Tensors: Reduction to Generalized Eigenvalue Decomposition
Now, the statement (i) follows from (S.1.3) by setting y = x. (ii) Since the vectors ci1 , . . . , ciK−1 are linearly independent in R , it follows that there exists a vector y such that det [ ci1 . . . ciK−1 y ] 6= 0. Hence, by (S.1.3), the (i1, . . . , iK−1)-th column of B(C) is nonzero. (iii) follows from (S.1.3) and the fact that det [ ci1 . . . ciK−1 y ] = 0 if and only if y ∈ span{ci1 , ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Biomedical and Health Informatics
سال: 2017
ISSN: 2168-2194,2168-2208
DOI: 10.1109/jbhi.2015.2491645